Cayley graphs of order 30p are Hamiltonian
نویسندگان
چکیده
Correspondence should be addressed to Dave Witte Morris, [email protected] Received 22 January 2011; Accepted 18 April 2011 Academic Editor: Cai Heng Li Copyright q 2011 E. Ghaderpour and D. W. Morris. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Suppose that G is a finite group, such that |G| 27p, where p is prime. We show that if S is any generating set ofG, then there is a Hamiltonian cycle in the corresponding Cayley graph Cay G;S .
منابع مشابه
COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
متن کاملCayley graph associated to a semihypergroup
The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as Hamiltonian cycles in this graph. Also, by some of examples we will illustrate the properties and behavior of these Cayley graphs, in particulars we show that ...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملHamiltonian cycles in cubic Cayley graphs: the 〈2,4k,3〉 case
It was proved by Glover and Marušič (J. Eur. Math. Soc. 9:775–787, 2007), that cubic Cayley graphs arising from groups G = 〈a, x | a2 = x = (ax)3 = 1, . . .〉 having a (2, s,3)-presentation, that is, from groups generated by an involution a and an element x of order s such that their product ax has order 3, have a Hamiltonian cycle when |G| (and thus also s) is congruent to 2 modulo 4, and have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012